Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
نویسندگان
چکیده
منابع مشابه
Newly Designed Quasi-Cyclic Low Density Parity Check Codes
This paper presents the construction of large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight which has cut down hardware implementation cost and complexity as compared to the connection of individual columns and rows. The construction of newly obtained codes gives a class of efficiently encodable quasi-cyclic LDPC codes.
متن کاملLow Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes
Abstract Using algebraic techniques, one of the co-authors has designed a [155,64,20] low density parity check code based on permutation matrices. This code is quasi-cyclic by construction and hence admits a convolutional representation. A set of low density parity check convolutional codes is derived from this quasi-cyclic code and its generalizations. We investigate the performance of these c...
متن کاملApproach to the construction of regular low-density parity-check codes from group permutation matrices
In this study, a new method for constructing low-density parity-check (LDPC) codes is presented. This construction is based on permutation matrices which come from a finite abstract group and hence the codes constructed in this manner are called group permutation low-density parity-check (GP-LDPC) codes. A necessary and sufficient condition under which a GP-LDPC code has a cycle, is given and s...
متن کاملA Construction for Low Density Parity Check Convolutional Codes Based on Quasi-Cyclic Block Codes
A set of convolutional codes with low density parity check matrices is derived from a class of quasi-cyclic low density parity check block codes. Their performance when decoded using the belief propagation algorithm is investigated.
متن کاملLow Density Parity Check Codes
Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2004
ISSN: 0018-9448
DOI: 10.1109/tit.2004.831841